Partitioning a split graph into induced subgraphs isomorphic to the path of order 3.
نویسندگان
چکیده
منابع مشابه
Partitioning a graph into two isomorphic pieces
A simple graph G has the neighbour-closed-co-neighbour property, or ncc property, if for all vertices x of G, the subgraph induced by the set of neighbours of x is isomorphic to the subgraph induced by the set of non-neighbours of x. We present characterizations of graphs with the ncc property via the existence of certain perfect matchings, and thereby prove that the ncc graphs can be recognize...
متن کاملPartitioning a graph into degenerate subgraphs
Let G = (V,E) be a graph with maximum degree k ≥ 3 distinct from Kk+1. Given integers s ≥ 2 and p1, . . . , ps ≥ 0, G is said to be (p1, . . . , ps)-partitionable if there exists a partition of V into sets V1, . . . , Vs such that G[Vi] is pi-degenerate for i ∈ {1, . . . , s}. In this paper, we prove that we can find a (p1, . . . , ps)-partition of G in O(|V |+|E|)-time whenever 1 ≥ p1, . . . ,...
متن کاملPartitioning a Graph into Highly Connected Subgraphs
Given k ≥ 1, a k-proper partition of a graph G is a partition P of V (G) such that each part P of P induces a k-connected subgraph of G. We prove that if G is a graph of order n such that δ(G) ≥ √ n, then G has a 2-proper partition with at most n/δ(G) parts. The bounds on the number of parts and the minimum degree are both best possible. We then prove that If G is a graph of order n with minimu...
متن کاملIsomorphic Subgraphs in a Graph
At the combinatorics meeting of this Proceedings J . Schönheim posed the following problem : Is it true, that every graph of n edges has two (not necessarily induced isomorphic edge disjoint subgraphs with say f edges? In the present note we answer this question in the affirmative . In fact we prove that every graph of n edges contains two isomorphic edge disjoint subgraphs with cn 2/3 edges an...
متن کاملPartitioning Graphs into Induced Subgraphs
We study the parametrized complexity of the Partition into Triangles problem. For this problem a (simple) graph with 3n vertices is given and the question is whether it is possible to cover its vertices with n triangles (complete graphs on 3 vertices). We prove that there is an FPT algorithm that decides the Partition into Triangles problem and that the existence of a polynomial size kernel is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series
سال: 2019
ISSN: 2524-2415,1561-2430
DOI: 10.29235/1561-2430-2019-55-1-32-49